NeST graphs
نویسندگان
چکیده
We establish results on NeST graphs (intersection tolerance graphs of neighborhood subtrees of a tree) and several subclasses. In particular, we show the equivalence of proper NeST graphs and unit NeST graphs, the equivalence of 5xed distance NeST graphs and threshold tolerance graphs, and the proper containment of NeST graphs in weakly chordal graphs. The latter two results answer questions of Monma, Reed and Trotter, and Bibelnieks and Dearing. ? 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
On nest modules of matrices over division rings
Let $ m , n in mathbb{N}$, $D$ be a division ring, and $M_{m times n}(D)$ denote the bimodule of all $m times n$ matrices with entries from $D$. First, we characterize one-sided submodules of $M_{m times n}(D)$ in terms of left row reduced echelon or right column reduced echelon matrices with entries from $D$. Next, we introduce the notion of a nest module of matrices with entries from $D$. We ...
متن کاملUsing turkey nest dams to recharge the main well in kariz
Excessive use of groundwater, especially in agriculture, has led to a drop in aquifer water levels, and along with droughts, has dealt irreparable losses such as drying of karizes, springs, wells and land subsidence. One of the traditional ways of protecting these resources is the use of rainwater catchment systems as an Iranian technique for storage of precipitation. Among water extraction sys...
متن کاملProzac Alters Reproductive Performance and Filial Cannibalism in Male Fighting Fish, Betta Splendens
Background: Fluoxetine (ProzacTM) is one of the most popular antidepressant that can be released to aquatic systems via sewage-treatment effluents. It is suspected to provoke substantial effects in the aquatic environment. Methods: In spawning tanks, specimens were exposed to concentrations of 0 and 0.54 µgl-1 fluoxetine from male introduction until the larvae had hatched. Prior to spawning, n...
متن کاملUniquely Restricted Matchings in Interval Graphs
A matching M in a graph G is said to be uniquely restricted if there is no other matching in G that matches the same set of vertices as M . We describe a polynomial-time algorithm to compute a maximum cardinality uniquely restricted matching in an interval graph, thereby answering a question of Golumbic et al. (“Uniquely restricted matchings”, M. C. Golumbic, T. Hirst and M. Lewenstein, Algorit...
متن کاملAnt foraging and minimal paths in simple graphs
Ants are known to be able to find paths of minimal length between the nest and food sources. The deposit of pheromones while they search for food and their chemotactical response to them has been proposed as a crucial element in the mechanism for finding minimal paths. We investigate both individual and collective behavior of ants in some simple networks representing basic mazes. The character ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 121 شماره
صفحات -
تاریخ انتشار 2002